Quotients of Uniform Positroids

Two matroids $M$ and $N$ are said to be concordant if there is a strong map from $M$. This also can stated by saying that each circuit of union circuits In this paper, we consider class called positroids, introduced Postnikov, utilize their combinatorics determine concordance among some them.
 More precisely, given uniform positroid, give purely combinatorial characterization family positroids with it. We do means associated decorated permutations. As byproduct our work, describe completely the collection particular subset positroids.